Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints

This paper proposes a stochastic user equilibrium SUE assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: 1 ride time, which is composed of invehicle and waiting times, 2 overload delay, 3 fare, 4 transfer constraints, and 5 departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model.